Graph Partitioning Implementation Strategy Pattern Name
ثبت نشده
چکیده
Context Many applications can be represented as a graph with a set of nodes connected by edges. The nodes and edges usually represent computation and communication. Each node and edge can have a weight that represents a particular cost of executing the computation or communication associated with it. In order to efficiently exploit parallelism in such problems, we need to decompose them among processing elements. To efficiently execute this application on a parallel platform, the computation must be load-balanced and the communication must be minimized. Graph partitioning is used to accomplish this task.
منابع مشابه
Partitioning Strategy Selection for In-Memory Graph Pattern Matching on Multiprocessor Systems
Pattern matching on large graphs is the foundation for a variety of application domains. The continuously increasing size of the underlying graphs requires highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, a fine-grained graph partitioning becomes...
متن کاملDivide and conquer partitioning techniques for smart water networks
Inserting remote control valves in a water distribution system allows the implementation of the “divide and conquer” paradigm that consists in dividing a large network into smaller subsystems, also called water network partitioning (WNP), for applying water balance, pressure control and water quality protection. Some heuristic procedures, based on different techniques (graph theory, clustering,...
متن کاملDynamic Domain Decomposition and Load Balancing in Parallel Simulation of Finite/discrete Elements
A dynamic domain decomposition strategy is proposed for the effective parallel implementation of combined finite/discrete element approaches. Attention is focused on the parallelised interaction detection between discrete objects. Issues including graph representation, initial partitioning and dynamic re-partitioning are discussed and a load imbalance detection and re-balancing scheme is also s...
متن کاملHaplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model
Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...
متن کاملAn Experimental Comparison of Partitioning Strategies in Distributed Graph Processing [Experiments and Analyses]
In this paper, we study the problem of choosing among partitioning strategies in distributed graph processing systems. To this end, we evaluate and characterize both the performance and resource usage of different partitioning strategies under various popular distributed graph processing systems, applications, input graphs, and execution environments. Through our experiments, we found that no s...
متن کامل